An algorithm for maximizing entropy subject to simple bounds

An unusual form of the maximum entropy problem is considered, that includes simple bound constraints on the Fourier coefficients of the required image, as well as nonnegativity conditions on the image intensities. The algorithm avoids mixing these constraints by introducing a parameter into the objective function that is adjusted by an outer iteration. For each parameter value an inner iteration solves a large optimization calculation, whose constraints are just the simple bounds, by a combination of the conjugate gradient procedure and an active set method. An important feature is the ability to make many changes to the active set at once. The outer iteration includes a test for inconsistency of all the given constraints. The algorithm is described, a proof of convergence is given, and there are some second-hand remarks on numerical results.     

A fluctuation theory for Markov chains

A fluctuation theory for Markov chains on an ordered countable state space is developed, using ladder processes. These are shown to be Markov renewal processes. Results are given for the joint distribution of the extremum (maximum or minimum) and the first time the extremum is achieved. Also a new classification of the states of a Markov chain is suggested. Two examples are given.     

The influence of aliphatic diols on the temperature of maximum density of water

The influence of various aliphatic diols on the temperature of maximum density (TMD) of water has been investigated. 1,2-Propanediol, 1,3-propanediol, 1,3-butanediol, 1,4-butanediol, 1,5-pentanediol, 1,6-hexanediol, and 2,5-hexanediol were found to yield positive structural contributions to the solute-induced shift in the TMD, i.e., they are structure makers. Contrariwise, data from the literature indicate that 1,2-ethanediol is a structure breaker. Relationships between the structure making/breaking tendencies of the solutes and the relative positions of the two hydroxyl groups are discussed.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

Limit theorems for records from discrete distributions

Weak and strong functional limit theorems are obtained for record values and record epochs in a sequence of independent random variables with common distribution F. The emphasis is on the case in which F is concentrated on the non-negative integers. For contrast, the well-known case of continuous F is also considered. Analogues of results obtained earlier by Resnick, de Haan and the author for continuous F are presented here for F concentrated on the non-negative integers. Also is investigated under which circumstances the latter case is so close to the continuous F case that the resulting limit theorems are the same.     

Weak convergence in applied probability

Weak convergence of probability measures on function spaces has been active area of research in recent years. While the theory has a somewhat abstract base, it is extremely useful in a wide variety of problems and we believe has much to offer to applied probability. Our aim in this survey paper is to discuss those aspects of the theory which are relevant to work in applied probability. After an introduction to the foundations of weak convergence, we shall discuss partial sum, point, Markov and extremal processes. These processes form the building blocks for many of the important models of applied probability.     

A Miura of the Painlevé I Equation and Its Discrete Analogs

We present Miura transformations for the continuous and several discrete Painlev\'e I equations. In the case of the continuous P_I, we use the Hamiltonian formulation of the Painlev\'e equations and show that there exists a Miura transformation between P_I and the binomial, second degree, equation of Cosgrove SD_V. In the case of the discrete P_I's we obtain two different kinds of Miuras. One kind relates a d-P_I to some other d-P_I while the other leads to discrete four-point equations which are the discrete analogs of the derivative of Cosgrove's equation SD_V.     

On the spectra of finite-dimensional quadratic Bose operators

A complete study of the spectrum of a finite-dimensional Bose operator is carried out in the paper. The cases in which the spectrum is discrete or continuous are studied. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 835–854, June, 1997. Translated by A. M. Chebotarev     

Min-Max Optimization of Several Classical Discrete Optimization Problems

In this paper, we study discrete optimization problems with min-max objective functions. This type of problems has direct applications in the recent development of robust optimization. The following well-known classes of problems are discussed: minimum spanning tree problem, resource allocation problem with separable cost functions, and production control problem. Computational complexities of the corresponding min-max version of the above-mentioned problems are analyzed. Pseudopolynomial algorithms for these problems are provided under certain conditions.